PRISM

Benchmark
Model:csma v.1 (MDP)
Parameter(s)N = 3, K = 4
Property:time_max (exp-reward)
Invocation (default)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -ii -heuristic speed -e 1e-6 -ddextraactionvars 100 -maxiters 1000000 csma.3-4.prism csma.props --property time_max
Execution
Walltime:65.6973922252655s
Return code:0
Relative Error:3.2792210080837755e-08
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 16:53:03 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -ii -heuristic speed -e 1e-6 -ddextraactionvars 100 -maxiters 1000000 csma.3-4.prism csma.props --property time_max

Parsing model file "csma.3-4.prism"...

Type:        MDP
Modules:     bus station1 station2 station3 
Variables:   b y1 y2 s1 x1 bc1 cd1 s2 x2 bc2 cd2 s3 x3 bc3 cd3 

Parsing properties file "csma.props"...

5 properties:
(1) "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]
(2) "all_before_min": Pmin=? [ !"collision_max_backoff" U "all_delivered" ]
(3) "some_before": Pmin=? [ F min_backoff_after_success<K ]
(4) "time_max": R{"time"}max=? [ F "all_delivered" ]
(5) "time_min": R{"time"}min=? [ F "all_delivered" ]

---------------------------------------------------------------------

Model checking: "time_max": R{"time"}max=? [ F "all_delivered" ]

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...

Computing reachable states...

Reachability (BFS): 135 iterations in 2.49 seconds (average 0.018452, setup 0.00)

Time for model construction: 2.488 seconds.

Type:        MDP
States:      1460287 (1 initial)
Transitions: 2396727
Choices:     1471059

Transition matrix: 75002 nodes (6 terminal), 2396727 minterms, vars: 51r/51c/13nd

Prob0E: 149 iterations in 3.09 seconds (average 0.020745, setup 0.00)

Prob1A: 1 iterations in 0.02 seconds (average 0.022000, setup 0.00)

goal = 13, inf = 0, maybe = 1460274
Time for computing an upper bound for expected reward: 30.914 seconds.
Upper bound for max expectation (variant 2): 1305456.8823529412

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=1460287, nc=1471046, nnz=2396714, k=3] [38.6 MB]
Building sparse matrix (transition rewards)... [n=1460287, nc=1471046, nnz=1261384, k=3] [25.6 MB]
Creating vector for state rewards... [11.1 MB]
Creating vector for inf... [11.1 MB]
Creating vector for lower bounds... [11.1 MB]
Creating vector for upper bounds... [11.1 MB]
Allocating iteration vectors... [4 x 11.1 MB]
TOTAL: [153.4 MB]

Starting iterations (interval iteration)...
Iteration 76: max relative diff=0.999960, 5.00 sec so far
Iteration 153: max relative diff=0.999898, 10.02 sec so far
Iteration 233: max relative diff=0.959508, 15.07 sec so far
Iteration 313: max relative diff=0.006577, 20.10 sec so far
Iteration 393: max relative diff=0.000002, 25.11 sec so far
Max relative diff between upper and lower bound on convergence: 9.75731E-07
Iterative method: 399 iterations in 28.17 seconds (average 0.063872, setup 2.69)
Maximum finite value in solution vector at end of interval iteration: 153.42159987950498

Value in the initial state: 116.81825966071361

Time for model checking: 62.369 seconds.

Result: 116.81825966071361 (value in the initial state)


Overall running time: 65.487 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.